A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pareto-based Cost Simulated Annealing for Multiobjective Optimization

In this paper, a multiobjective simulated annealing (MOSA) method is introduced and discussed with the multiobjective evolutionary algorithms (MOEAs). Though the simulated annealing is a very powerful search algorithm and has shown good results in various singleobjective optimization fields, it has been seldom used for the multiobjective optimization because it conventionally uses only one sear...

متن کامل

A Fast Kinoform Optimization Algorithm Based on Simulated Annealing

Computer Generated Holography (CGH) [7] is a technique which generate a hologram by using computers. The CGH can be used in many applications, such as optical interconnection, optical information, optical elements and so on. The great advantage of the CGH is that it can be generate a hologram of virtual objects. The kinoform [6], one of the CGHs, is an attractive device that can manage wave fro...

متن کامل

portfolio optimization with simulated annealing algorithm

the markowitz issue of optimization can’t be solved by precise mathematical methods such as second order schematization, when real world condition and limitations are considered. on the other hand, most managers prefer to manage a small portfolio of available assets in place of a huge portfolio. it can be analogized to cardinal constrains, that is, constrains related to minimum and maximum curr...

متن کامل

Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems

In this paper we consider a simulated annealing algorithm for multiobjective optimization problems. With a suitable choice of the acceptance probabilities, the algorithm is shown to converge asymptotically, that is, the Markov chain that describes the algorithm converges with probability one to the Pareto optimal set.

متن کامل

Simulated Annealing-Based Ant Colony Algorithm for Tugboat Scheduling Optimization

As the “first service station” for ships in the whole port logistics system, the tugboat operation system is one of the most important systems in port logistics. This paper formulated the tugboat scheduling problem as a multiprocessor task scheduling problem MTSP after analyzing the characteristics of tugboat operation. The model considers factors of multianchorage bases, different operation mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Evolutionary Computation

سال: 2008

ISSN: 1941-0026,1089-778X

DOI: 10.1109/tevc.2007.900837